Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics
نویسندگان
چکیده
Description Logics knowledge bases are traditionally divided into a terminological part (Tbox), and an assertional part (Abox). However, most of recent results on practical algorithms are confined to terminological reasoning only. Due to the applications of Description Logics for databases and the so-called “Semantic Web”, there is a growing interest for practical algorithms for Abox reasoning. In this paper we present an algorithm for deciding knowledge base satisfiability based on the idea of separating terminological and assertional reasoning. This modularity allows to build complete Description Logics systems, by reusing available terminological reasoners.
منابع مشابه
Data Complexity of Reasoning in Very Expressive Description Logics
Data complexity of reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size of the ABox only. We show that, even for the very expressive DL SHIQ, satisfiability checking is data complete for NP. For applications with large ABoxes, this can be a more accurate estimate than the usually considered combined complexity, which is EXPTIMEcomplete. Fu...
متن کاملFinite Model Reasoning in Horn Description Logics
We study finite model reasoning in expressive Horn description logics (DLs), starting with a reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies on reversing certain cycles in the TBox, an approach that originated in database theory, was later adapted to the inexpressive DL DL-LiteF , and is shown here to extend to the expressive Horn DL Horn-ALCFI. The m...
متن کاملEvaluating a Modular Abox Algorithm
This work constitutes an advance in the direction of the development of Description logic systems providing efficient and powerful reasoning in presence of individuals. We present the empirical evaluation of an algorithm for checking the satisfiability of Description logic knowledge bases. The experiments we performed show that a modular algorithm, which separates terminological and hybrid reas...
متن کاملCompletion Graph Caching for Expressive Description Logics
Reasoning in very expressive Description Logics (DLs) such as SROIQ is often hard since non-determinism, e.g., from disjunctions or cardinality restrictions, requires a case-by-case analysis and since a strict separation between intensional (TBox) and extensional (ABox) knowledge is not possible due to nominals. Current state-of-the-art reasoners for SROIQ are typically based on (hyper-)tableau...
متن کاملExploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed up TBox and ABox reasoning for the description logics ALCNHR+ and ALC(D). The advances are demonstrated by an empirical analysis using the description logic system RACE that implements TBox and ABox reasoning for ALCNHR+ .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002